A Comparison of Succinctly Represented Finite-State Systems
نویسندگان
چکیده
We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.
منابع مشابه
Finite State Methods and Description Logics
The accepting runs of a finite automaton are represented as concepts in a Description Logic, for various systems of roles computed by finitestate transducers. The representation refines the perspective on regular languages provided by Monadic SecondOrder Logic (MSO), under the BüchiElgot-Trakhtenbrot theorem. String symbols are structured as sets to succinctly express MSO-sentences, with auxili...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملStability analysis of impulsive fuzzy differential equations with finite delayed state
In this paper we introduce some stability criteria for impulsive fuzzy system of differential equations with finite delay in states. Firstly, a new comparison principle for fuzzy differential system compared to crisp ordinary differential equation, based on a notion of upper quasi-monotone nondecreasing, in N dimentional state space is presented. Furthermore, in order to analyze the stability o...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کامل